A Network - Related Nuclear Power Plant Model with an Intelligent Branch - and - Bound Solution Approach

This paper presents a network model with discrete requirements for a nuclear power plant. The model determines the batch size and timing for nuclear unit refueling and how much energy should be produced by nuclear and non-nuclear units for each time period to satisfy forecasted demand with minimum total operating costs over the planning horizon. Efficient modeling and solution strategies are developed which constitute a merger of operations research and artificial intelligence. A branch-and-bound solution approach is combined with a pattern recognition component, involving non-parametric discrimination analyses, to select branching variables and directions. By coupling this approach with network optimization techniques to exploit the underlying network structure of the problem, substantial improvements are obtained both in solution quality and solution efficiency.